Categorical Equivalences from State-Effect Adjunctions
نویسندگان
چکیده
منابع مشابه
Combinatorial Categorical Equivalences
In this paper we prove a class of equivalences of additive functor categories that are relevant to enumerative combinatorics, representation theory, and homotopy theory. Let X denote an additive category with finite direct sums and splitting idempotents. The class includes (a) the Dold-Puppe-Kan theorem that simplicial objects in X are equivalent to chain complexes in X ; (b) the observation of...
متن کاملSome Methodological Remarks about Categorical Equivalences
In this paper, it is remarked that BZ lattice structures can recover several theoretical approaches to rough sets, englobing their individual richness in a unique structure. Rough sets based on a similarity relation are also considered, showing that the BZ lattice approach turns out to be even more useful, since enables one to define another rough approximation, which is better than the corresp...
متن کاملCategorical equivalences for p 0 quasi - MV algebras
In previous investigations into the subject ([4], [9], [1]), p 0 quasi-MV algebras have been mainly viewed as preordered structures w.r.t. the induced preorder relation of their quasi-MV term reducts. In this paper, we shall focus on a di¤erent relation which partially orders cartesian p 0 quasi-MV algebras. We shall prove that: a) every cartesian p 0 quasi-MV algebra is embeddable into an inte...
متن کاملDERIVED EQUIVALENCES FOR COTANGENT BUNDLES OF GRASSMANNIANS FROM CATEGORICAL sl2 ACTIONS
We construct an equivalence of categories from a strong categorical sl(2) action, following the work of Chuang-Rouquier. As an application, we answer a question of Namikawa and give an explicit equivalence of categories between coherent sheaves on cotangent bundles to complementary Grassmannians.
متن کاملNonaxiomatisability of Equivalences over Finite State Processes
This paper considers the existence of finite equational axiomatisations of behavioural equivalences over a calculus of finite state processes. To express even simple properties such as xE = xE[E=x] some notation for substitutions is required. Accordingly the calculus is embedded in a simply typed lambda calculus, allowing such schemas to be expressed as equations between terms containing first ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.287.6